On Safety of Unary and Non-unary IFP-operators
نویسندگان
چکیده
منابع مشابه
Manipulating Fuzzy Summaries of Databases: Unary Operators and Their Properties
In this paper we propose a general framework to explore and analyse database summaries built from massive data sets. Summaries are multidimensional vague concepts, represented by a set of fuzzy terms provided on each attribute as domain knowledge. We define a logical data model called summary partition, as cubes do in OLAP systems. We then propose a set of unary operators over this data model. ...
متن کاملUnary negation
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and the μcalculus, as well as conjunctive queries and monadic Datalog. We show that satisfiability and finite satisfiability are decidable for both fragments, a...
متن کاملQuerying fuzzy summaries of databases: unary operators and their properties
In this paper we propose a general framework to explore and analyse database summaries built from massive data sets. Summaries are multidimensional vague concepts, represented by a set of fuzzy terms provided on each attribute as domain knowledge. We define a logical data model called summary partition, as cubes do in OLAP systems. We then propose a set of unary operators over this data model. ...
متن کاملStrucutre and Complexitiy in Planning with Unary Operators
In this paper we study the complexity of STRIPS planning when operators have a single effect. In particular, we show how the structure of the domain’s causal graph influences the complexity of planning. Causal graphs relate between preconditions and effects of domain operators. They were introduced by Williams and Nayak, who studied unary operator domains because of their direct applicability t...
متن کاملOn elementarily -homogeneous unary structures
Let L be a first-order language with equality and let U be an L-structure of cardinality . If @0 , then we say that U is elementarily -homogeneous iff any two substructures of cardinality are elementarily equivalent, and -homogeneous iff any two substructures of cardinality are isomorphic. In this note, we classify the elementarily -homogeneous structures .A; f / where f W A! A is a function an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modeling and Analysis of Information Systems
سال: 2018
ISSN: 2313-5417,1818-1015
DOI: 10.18255/1818-1015-2018-5-525-533